Comparison of Two Subspace Identification Methods for Combined Deterministic-Stochastic Systems

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Subspace Identification Method for Combined Deterministic-stochastic Bilinear Systems

In this paper, a ‘four-block’ subspace system identification method for combined deterministic-stochastic bilinear systems is developed. Estimation of state sequences, followed by estimation of system matrices, is the central component of subspace identification methods. The prominent difference of our new approach is a ‘four-block’ arrangement of data matrices which leads to a linearization of...

متن کامل

A subspace method for frequency selective identification of stochastic systems ⋆

A parametric method for the estimation of vector valued discrete-time stochastic systems or equivalently the spectrum of a stochastic process is presented. The key feature is that the method can be used to frequency selectively fit the model to the data. This means that parts of the spectrum can be modeled with a lower model order than otherwise would be necessary if the entire spectrum would b...

متن کامل

investigation of single-user and multi-user detection methods in mc-cdma systems and comparison of their performances

در این پایان نامه به بررسی روش های آشکارسازی در سیستم های mc-cdma می پردازیم. با توجه به ماهیت آشکارسازی در این سیستم ها، تکنیک های آشکارسازی را می توان به دو دسته ی اصلی تقسیم نمود: آشکارسازی سیگنال ارسالی یک کاربر مطلوب بدون در نظر گرفتن اطلاعاتی در مورد سایر کاربران تداخل کننده که از آن ها به عنوان آشکارساز های تک کاربره یاد می شود و همچنین آشکارسازی سیگنال ارسالی همه ی کاربران فعال موجود در...

Algorithms for deterministic balanced subspace identification

New algorithms for identification of a balanced state space representation are proposed. They are based on a procedure for the estimation of impulse response and sequential zero input responses directly from data. The proposed algorithms are more efficient than the existing alternatives that compute the whole Hankel matrix of Markov parameters. It is shown that the computations can be performed...

متن کامل

Experimental Evidence Showing That Stochastic Subspace Identification Methods May Fail*

It is known that certain popular stochastic subspace identification methods may fail for theoretical reasons related to positive realness. In fact, these algorithms are implicitly based on the assumption that the positive and algebraic degrees of a certain estimated covariance sequence coincide. In this paper, we describe how to generate data with the property that this condition is not satisfi...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Proceedings of the ISCIE International Symposium on Stochastic Systems Theory and its Applications

سال: 2000

ISSN: 2188-4730,2188-4749

DOI: 10.5687/sss.2000.7